Όλο το DSpace

Πλοήγηση ανά Συγγραφέα "Corral, A."

Αποτελέσματα 1-6 από 6

    • The deletion operation in xBR-trees 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A. (2012)
      In order to design a spatial index, the most important operations are: insertion, deletion and search. We focus on the deletion operation over the xBR-tree, a spatial data secondary memory structure that belongs to the ...

    • Join-queries between two spatial datasets indexed by a single R*-tree 

      Vassilakopoulos, M.; Corral, A.; Karanikolas, N. N. (2011)
      A spatial join, a common query in Spatial Databases and Geographical Information Systems (GIS), consists in testing every possible pair of data elements belonging to two spatial datasets against a spatial predicate. This ...

    • Nearest Neighbor Algorithms using xBR-Trees 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A. (2011)
      One of the common queries in spatial databases is the (K) Nearest Neighbor Query that discovers the (K) closest objects to a query object. Processing of spatial queries, in most cases, is accomplished by indexing spatial ...

    • A new plane-sweep algorithm for the k-closest-pairs query 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A.; Manolopoulos, Y. (2014)
      One of the most representative and studied Distance-Based Queries in Spatial Databases is the K-Closest-Pairs Query (KCPQ). This query involves two spatial data sets and a distance function to measure the degree of closeness, ...

    • Plane-sweep algorithms for the K Group Nearest-Neighbor Query 

      Roumelis, G.; Vassilakopoulos, M.; Corral, A.; Manolopoulos, Y. (2015)
      One of the most representative and studied queries in Spatial Databases is the (K) Nearest-Neighbor (NNQ), that discovers the (K) nearest neighbor(s) to a query point. An extension that is important for practical applications ...

    • Predictive join processing between regions and moving objects 

      Corral, A.; Torres, M.; Vassilakopoulos, M.; Manolopoulos, Y. (2008)
      The family of R-trees is suitable for indexing various kinds of multidimensional objects. TPR*-trees are R-tree based structures that have been proposed for indexing a moving object database, e.g. a data-base of moving ...